10x Matrix Searching Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Searching for a spindle matrix

New evidence supports the idea of a nonmicrotubule spindle matrix, but the debate about the reality of this structure continues.

متن کامل

Imperfect quantum searching algorithm

We point out that the criterion, derived by Long et al.[Phys. Rev A 61, 042305 (2000)], to judging the degree of inaccuracy under systematic errors in phase inversions in Grover’s quantum search algorithm is overestimated. Although this criterion is properly deduced, it lacks a more accurate characterization to the relation between systematic errors and the size of a quantum database. The crite...

متن کامل

Linear Order Matrix Inversion Method with Help from Quantum Searching Algorithm

Presented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension one by one. Total iteration steps required for search are proportional to the number of unknown variables. Our method could solve very large linear equations w...

متن کامل

Greater than 10x Acceleration of fusion plasma edge simulations using the Parareal algorithm

Simulations involving the edge of magnetically confined, fusion plasma are an extremely challenging task. The physics in this regime is particularly complex due to the presence of neutrals as well as the wall. These simulations are extremely computationally intensive but are key to rapidly achieving thermonuclear breakeven on ITER-like machines. Space parallelization has hitherto been the most ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2016

ISSN: 0975-8887

DOI: 10.5120/ijca2016911258